Reconstructing a convex polygon from its $\omega$-cloud

نویسندگان

  • Prosenjit Bose
  • Jean-Lou De Carufel
  • Elena Khramtcova
  • Sander Verdonschot
چکیده

An ω-wedge is the (closed) set of all points contained between two rays that are emanating from a single point (the apex), and are separated by an angle ω < π. Given a convex polygon P , we place the ω-wedge such that P is inside the wedge and both rays are tangent to P . The ω-cloud of P is the curve traced by the apex of the ω-wedge as it rotates around P while maintaining tangency in both rays. We investigate reconstructing a polygon P from its ω-cloud. Previous work on reconstructing P from probes with the ω-wedge required knowledge of the points of tangency between P the two rays of the ω-wedge. Here we show that if ω is known, the ω-cloud alone uniquely determines P , and we give a linear-time reconstruction algorithm. Furthermore, even if we only know that ω < π/2, we can still reconstruct P , albeit in cubic time in the number of vertices. This reduces to quadratic time if in addition we are given the location of one of the vertices of P .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Analytical Solution for Inverse Determination of Residual Stress Field

An analytical solution is presented that reconstructs residual stress field from limited and incomplete data.  The inverse problem of reconstructing residual stresses is solved using an appropriate form of the airy stress function.  This function is chosen to satisfy the stress equilibrium equations together with the boundary conditions for a domain within a convex polygon.  The analytical solu...

متن کامل

Reconstructing a convex polygon from its ω-cloud

An ω-wedge consists of two rays emanating from a single 1 point (the apex), separated by an angle ω < π. Given a convex polygon 2 P , we place the ω-wedge such that P is inside the wedge and both rays 3 are tangent to P . The ω-cloud of P is the curve traced by the apex of 4 the ω-wedge as it rotates around P while maintaining tangency in both 5 rays. 6 Previous work crucially required knowledg...

متن کامل

Algorithm for finding the largest inscribed rectangle in polygon

In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...

متن کامل

Point Cloud Segmentation to Approximately Convex Surfaces for Fruit Recognition

A fruit recognition approach based on segmenting the point cloud acquired by a 3D camera into approximately convex surfaces is considered. A segmentation approach which transforms a depth image into a triangular mesh and then segments this mesh into approximately convex segments is applied to depth images of fruits on trees. An analysis of the results obtained by this approach is performed with...

متن کامل

Joint Allocation of Computational and Communication Resources to Improve Energy Efficiency in Cellular Networks

Mobile cloud computing (MCC) is a new technology that has been developed to overcome the restrictions of smart mobile devices (e.g. battery, processing power, storage capacity, etc.) to send a part of the program (with complex computing) to the cloud server (CS). In this paper, we study a multi-cell with multi-input and multi-output (MIMO) system in which the cell-interior users request service...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018